<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>Title</title>
    <style>
        span {
            color: green;
        }

        .nav {
            color: red;
        }

        .nav li {
            color: blue;
        }
    </style>
</head>
<body>
<!--<script>
    function getUrlParam(sUrl, sKey) {
        var result = {};
        /**
         * 　第一个参数：正则所匹配到的字符；
         　　第二个参数：捕获括号所捕获到的字符；
         　　第三个参数：正则匹配到的每段字符的第一个字符的索引；
         　　第四个参数：用于匹配的字符串主体；
         */
        sUrl.replace(/\??(\w+)=(\w+)&?/g, function (a, k, v, j) {

            console.log("result", result)
            console.log("c1", a);
            console.log("c2", k);
            console.log("c3", v);
            console.log(j);
            //使用.必须跟属性名，使用[]的时候，可以在[]中可以是一个变量
            if (result[k] !== void 0) {
                var t = result[k];
                console.log("res", result)
                result[k] = [].concat(t, v);
            } else {
                result[k] = v;
            }
        });
        if (sKey === void 0) {
            return result;
        } else {
            return result[sKey] || '';
        }
    }

    console.log(getUrlParam("http://www.nowcoder.com?key=1&key=2&key=3&test=4&value=10#hehe","value"))
</script>-->

<!--<script>
    /*var str="-abc-cdv-fsdfds-";
    console.log(str.replace("a","Q"));
    console.log(str);
    var arr=[];
    /!*str.replace(/-?([a-zA-z]+)/g,function(a,k){
        arr.push(k);
    });*!/

    for(var i=1;i<arr.length;i++){
        var j=arr[i].slice(0,1).toUpperCase();
        //console.log(arr[i].replace(/[a-zA-Z]/,"AA"));
        //arr[i] = arr[i][0].toUpperCase() + arr[i].substring(1);
        /!*console.log(arr[i]);
        console.log(j);*!/
        console.log(arr[i]);
    }
    var stt=arr.join("");
    //console.log(stt);*/
</script>-->

<!--<script>
    var input, result;
    if((input=readInt())!=null){
        //console.log(input);
    }
    result = input * 0.8;
    result = step();
    print(Math.round(result));
    
    function step() {
        var ynsrde = (input - input*0.2 - 3500) < 0 ? 0 :
            (input - input*0.2 - 3500);
        var jsed = 0;
        if(ynsrde<=1500){
            jsed = ynsrde * 0.03;
        }else if(ynsrde>1500 && ynsrde<=4500){
            jsed = ynsrde * 0.1 - 105;
        }else if(ynsrde>4500 && ynsrde<=9000){
            jsed = ynsrde * 0.2 - 555;
        }else if(ynsrde>9000 && ynsrde<=35000){
            jsed = ynsrde * 0.25 - 1005;
        }else if(ynsrde>35000 && ynsrde<=55000){
            jsed = ynsrde * 0.3 - 2755;
        }else if(ynsrde>55000 && ynsrde<=80000){
            jsed = ynsrde * 0.35 - 5505;
        }else if(ynsrde>80000){
            jsed = ynsrde * 0.45 - 13505;
        }
        return result - jsed;
    }
</script>-->

<!--<script>
    /*var lineAdd=0;//输入行计数
    var inputArr=['4 4','1 2','2 1','2 3','1 0','2','1 2','3 0']; //输入两行*/

    var line, n, m, mCount,
        connectArr = [],
        q, qCount,
        willCheckArr = [], checkedNum = 0;
    if((line=read_line())!=null){
        line = line.split(" ");
        n = line[0];
        m = line[1];
        mCount = parseInt(m);
    }
    while (mCount&ndash;&gt;0){
        (function () {
            if((line=read_line())!=null){
                line = line.split(" ");
                connectArr.push({
                    i: line[0],
                    j: line[1]});
            }
        })();
    }
    print(connectArr);
    if((line=read_line())!=null){
        q = line;
        qCount = parseInt(q);
    }
    while (qCount&ndash;&gt;0){
        (function () {
            if((line=read_line())!=null){
                line = line.split(" ");
                willCheckArr.push({
                    i: line[0],
                    j: line[1]});
            }
        })();
    }

    loop();

    function loop(connectArr, willCheckArr) {
        for(var item in willCheckArr){
            var b = false;
            for(var temp in connectArr){
                //直连
                if((temp.i == item.i && temp.j == item.j)
                    || (temp.i == item.j && temp.j == item.i)){
                    checkedNum++;
                    b = true;
                    break;
                }
            }
            //间接
            if(!b){
                loop();
            }
        }
    }

    print(checkedNum);
    /*//模拟输入
    function read_line(){
        var line=inputArr[lineAdd];
        lineAdd++;
        return line;
    }
    //模拟输出
    function print(x){
        console.log(x);
    }*/
</script>-->

<script>
    /*var a=1;
     function funcA() {
     alert(a);
     var a=2;
     alert(this.a);
     }
     funcA();*/

    /*var a = {
     value: 2,
     toString: function () {
     return ++this.value;
     }
     };
     (function () {
     if(a==3 && a==4){
     console.log('js is amazing');
     }else {
     console.log(false);
     }
     })();*/
</script>
<!--<script>
    /*var a = 0.3;
    console.log(a - 0.1 == 0.2);
    console.log(a == true);
    console.log(!!~(a-a));*/

    /*for(var i=0; i<5; i++){
        (function (i) {
            setTimeout(function () {
                console.log(i)
            }, i*1000)
        })(i);
    }*/

    /*console.log(1&&2);
    console.log(1||2);*/

    //通过每次与前一位的最大连续子串的信息做比较进行拼接
    function getTempByPrevSeq(PrevTemp, currentValue) {
        //这里规定，0也可以进行子串拼接
        if (PrevTemp.sum >= 0) {
            return {
                num: PrevTemp.num + 1,
                sum: PrevTemp.sum + currentValue
            };
        } else {
            return {
                num: 1,
                sum: currentValue
            }
        }
    }

    function getMaxSumSeqArr(input) {
        if (input.length === 0) return;
        var temps = []; // 存储每一位与前面连续之后可得最大值的信息，以便后面的每一位进行迭代更新

        //第一位向前的最大子串就是它自己本身
        var temp = {
            num: 1,
            sum: input[0]
        };
        temps.push(temp);

        for (var i = 1, len = input.length; i < len; i++) {
            var ref = input[i];
            //从前向后迭代
            var temp = getTempByPrevSeq(temps[i-1], ref);
            temps.push(temp);
        }

        //存储了迭代过程中的信息, 可以在这里看看
        //console.log(temps);

        var maxValue, //获取最大值
            indexArr = []; //获取多个结果的index

        maxValue = temps[0].sum;
        indexArr.push(0);

        for (var i = 1, len = temps.length; i < len; i++) {
            var ref = temps[i];
            if (ref.sum === maxValue) {
                indexArr.push(i);
            } else if (ref.sum > maxValue) {
                maxValue = ref.sum;
                indexArr.length = 0; //重置数组
                indexArr.push(i);
            }
        }

        //output
        //console.log("MaxValue: " + maxValue);
        for (var i = 0, len = indexArr.length; i < len; i++) {
            var index     = indexArr[i],
                ref     = temps[index];
            console.log(input.slice(index-ref.num+1, index+1));
        }

    }

    var input1 = [1, -2, 3, 10, -4, 7, 2, -5];
    getMaxSumSeqArr(input1);

</script>-->

<script>
    /* let d = 1;
     console.log(d);
     var f = () => 5;
     console.log(f());*/
</script>

<script>
    /*var s1=parseInt("10*22");
     document.write(s1);*/
    /*const g={b:3};
     console.log(g.b);*/
    /*function changeStuff(a,b,c) {
     a=a*10;
     }
     var num = 10;
     changeStuff(num, null, null);
     console.log(num);*/

    /*(new Promise(resolve=>{
     resolve(4);
     Promise.resolve(3).then(t=>{console.log(t);});
     console.log(1);
     })).then(t=>{
     console.log(t);
     })
     console.log(2);*/

    /*for(var i=0;i<5;i++){
     setTimeout(function () {
     console.log(i);
     },100)
     }
     console.log(i);*/


</script>

<!--<div style="width: 100%;border-bottom: 0.5px solid red"></div>-->
<div class="nav">
    <ul>
        <li><span>文字</span></li>
    </ul>
</div>

<script>
    /*var obj = [
     {id:1, parent:null},
     {id:2, parent:1},
     {id:3, parent:2}
     ];
     /!**
     * 树状的算法
     * @params list     代转化数组
     * @params parentId 起始节点
     *!/
     function getTrees(list, parentId) {
     let items= {};
     // 获取每个节点的直属子节点，*记住是直属，不是所有子节点
     for (let i = 0; i < list.length; i++) {
     let key = list[i].parent;
     if (items[key]) {
     items[key].push(list[i]);
     } else {
     items[key] = [];
     items[key].push(list[i]);
     }
     }
     return formatTree(items, parentId);
     }

     /!**
     * 利用递归格式化每个节点
     *!/
     function formatTree(items, parentId) {
     let result = [];
     if (!items[parentId]) {
     return result;
     }
     for (let t of items[parentId]) {
     t.child = formatTree(items, t.id)
     result.push(t);
     }
     return result;
     }
     console.log(getTrees(obj, null));*/

    /*var log = function () {
     let length = arguments.length;
     let result = "(app)";
     for(let i=0; i<length; i++){
     result += (arguments[i].toString() + " ");
     }
     console.log(result.trim());
     };
     log("hello", "world");*/
</script>

<script>
    /* var line = readline();
     var lines = line.split(" ");
     var n = D
     var k = parseInt(lines[1]);
     var line1 =readline();
     var lines1 = line1.split(" ");
     var nArray = [];
     for(var item in lines1){
     nArray.push(item);
     }

     var s = 0, m = 0;
     (function () {
     for(var i=0; i<k; i++){

     }
     })();*/

    //城市 居民
    /*var line = readline();
     var n = parseInt(line);
     var arrx = [];
     var arry = [];
     (function () {
     for(var i=0; i<n; i++){
     var temp = readline();
     arrx.push(temp.split(" ")[0]);
     arry.push(temp.split(" ")[1]);
     }
     })();
     arrx.sort();
     arry.sort();
     var width, height;
     width = arrx[n-1] - arrx[0];
     height = arry[n-1] - arry[0];
     console.log(width >= height ? width*width : height*height);*/

    //小明看花
    /*var line = read_line();
     var n = line.split(" ")[0];
     var m = line.split(" ")[0];
     line = read_line();
     var nArray = line.split(" ");
     line = read_line();
     var q = parseInt(line);
     var qx = [];
     var qy = [];
     (function () {
     for(var i=0; i<q; i++){
     var temp = read_line();
     qx.push(temp.split(" ")[0]);
     qy.push(temp.split(" ")[1]);
     }
     })();
     var count = function (x, y) {
     var temp = [];
     for(var i=x; i<=y; i++){
     if(temp.indexOf(nArray[i]) === -1){//不存在
     temp.push(nArray[i]);
     }
     }
     print(temp.length);
     };
     (function () {
     for(var i=0; i<q; i++){
     count(qx[i]-1, qy[i]-1);
     }
     })();*/

    //排列数组
    /*var line = read_line();
     var n = parseInt(line);
     line = read_line();
     var a = line.split(" ");
     line = read_line();
     var b = line.split(" ");

     print(2);*/

    //组队参赛
    /*var line = read_line();
     var lines = line.split(" ");
     var n = parseInt(lines[0]);
     var m = parseInt(lines[1]);*/
    //求阶乘
    /*function factorial(num) {
     var result = 1;
     while (num) {
     result *= num;
     num--;
     }
     return result;
     }
     //C n m排列组合
     function C_nm(n, m) {
     return factorial(n) / factorial(m) / factorial(n - m);
     }*/
    //print(C_nm(n, 1)*C_nm(m, 2) + C_nm(n, 2)*C_nm(m, 1));
    //var n = 4, m = 6, result = 0;
    //组队参赛
    /*var line = read_line();
     var lines = line.split(" ");
     var n = parseInt(lines[0]);
     var m = parseInt(lines[1]);
     var result = 0;
     if(n === 1 && m === 1){
     print(result);
     }else if(n < m){
     result += n;
     if(n > Math.floor(m / 2.0)){
     result -= n - Math.floor(m / 2.0);
     }
     print(result);
     }else if(m < n){
     result += m;
     if(m > Math.floor(n / 2.0)){
     result -= m - Math.floor(n / 2.0);
     }
     print(result);
     }*/
</script>
<script>
    /*var line = read_line();
     var s = line, result = 0, index = 1;
     var getMax = function () {

     };
     while (index < s.length - 1){
     if(s[index - 1] !== s[index]){

     }
     index++;
     }*/

    //房子
    /*var line = read_line();
     var num = parseInt(line);
     var testArray = [];
     (function () {
     for(var i = 0; i< num; i++){
     var temp = read_line();
     testArray.push(temp);
     }
     })();
     var minMax = function (str) {
     var n = str.split(" ")[0];
     var k = str.split(" ")[1];
     var min = 0, max = 0;
     if(n < 3){
     max = 0;
     }else {
     var half = Math.floor(n / 2.0);
     max = (half & 0x1) === 0 ? half - 1 : half;
     }
     print("" + min + " " + max);
     };
     (function () {
     for(var i = 0; i< num; i++){
     minMax(testArray);
     }
     })();*/

    //整数反序
    /*var line = read_line();
     var n = parseInt(line);
     var flag = n < 0;
     var p = flag ? -n : n;
     var p1 = parseInt(p);
     var p2 = parseFloat(p);
     if(p > 0 && p1==p2){
     //数字反转
     p=p.toString().split('').reverse();
     var i=0;
     var result='';
     while (i<p.length){
     result += p[i];
     i++;
     }
     (function () {
     for(var i=0; i<result.length; i++){
     if(result[i] === "0"){
     continue;
     }
     result = result.substring(i);
     break;
     }
     })();
     print(flag ? "-"+result : result);
     }*/

    //26进制加法
    //26进制转十进制：
    /*function convert26BSToDS(code) {
     var num = -1;
     var reg = /^[a-z]+$/g;
     if (!reg.test(code)) {
     return num;
     }
     num = 0;
     //从个位数从右到左
     for (var i = code.length - 1, j = 1; i >= 0; i--, j *= 26) {
     num += (code[i].charCodeAt() - 97) * j;//a的ascii字符十进制为97
     }
     return num;
     }
     console.log(convert26BSToDS("abab"));
     //十进制转26进制：
     function convertDSTo26BS(num) {
     var reg = /^\d+$/g;
     if (!reg.test(num)) {
     return code;
     }
     var dest = "", az = "abcdefghijklmnopqrstuvwxyz";
     do {
     dest = az.charAt(num % 26) + dest;
     num /= 26.0;
     } while (num >= 1);
     return dest;
     }

     console.log(convertDSTo26BS(677));
     var n = "gfedcba";
     var m = "cba";
     console.log(convertDSTo26BS(convert26BSToDS(n) + convert26BSToDS(m)));*/
    /*var line = read_line();
     var n = line;
     line = read_line();
     var m = line;*/

    //小数表示 有限循环 无限循环
    var m = 1, n = 6;
    /*var func = function (m, n) {
     var list = [];
     var sb = "";
     m = m % n;
     while (m != 0) {
     if (list.indexOf(m) > -1) {
     for (var i = 0; i < sb.length; i++) {
     if (sb.charAt(i) - '0' == Math.floor(m * 10 / n)) {//记录循环节开始的位置
     break;
     }
     }
     sb = sb.substring(i);
     break;
     } else {
     list.push(m + "");//装入余数
     sb += "" + Math.floor(m * 10 / n) + "";//装入商的值
     }
     m = m * 10 % n;
     }
     return sb;
     };*/
    /*var mapKey = [];//记录余数个数的数据结构
     var mapValue = [];
     var func = function (a, b) {
     var isLoop = true;
     var count = 0.0;
     var remainder = a % b;
     var mark = 0;
     //获取余数直到余数为零，或者出现余数相等判定为无限循环小数
     while (isLoop) {
     if (remainder == 0) {
     count =  1.0 * a / b;
     return count;
     } else if (mapKey.indexOf(remainder) < 0) {
     mapKey.push(remainder);
     mapValue.push(mark);
     mark++;
     } else {
     count = mark - mapValue[mapKey.indexOf(remainder)];
     return count;
     }
     while (remainder < b) {
     remainder = remainder * 10;
     }
     remainder %= b;
     }
     return count;
     };
     console.log(func(1, 7));
     console.log(1 / 7);
     console.log(mapKey);
     console.log(mapValue);*/

    //爬楼梯
    /*var line = read_line();
     var cost = line.split(",");*/
    /*var cost = [1,100,1,1,1,100,1,1,100,1];
     var minCostClimbingStairs = function (cost) {
     var n = cost.length;
     var dp = [];
     dp[0] = cost[0];
     dp[1] = cost[1];
     (function () {
     for(var i=2;i<n;i++){
     dp[i] = cost[i] + dp[i-2] < dp[i-1] ? dp[i-2] : dp[i-1];
     }
     })();

     return dp[n-2] < dp[n-1] ? dp[n-2] : dp[n-1];
     };
     //print(minCostClimbingStairs(cost));
     console.log(minCostClimbingStairs(cost));*/

    //时区
    /*var line = read_line();
    var t = parseInt(line);
    //var array = ["UTC+0 9 0", "UTC-2 7 9", "UTC+7 23 59"];
    var array = [];
    (function () {
        for (var i = 0; i < t; i++) {
            array.push(read_line());
        }
    })();
    var func = function (str) {
        var temp = str.split(" ");
        var zone = temp[0], hour = temp[1], min = temp[2], interval = 0;
        if (zone.indexOf("+") > 0) {
            interval = parseInt(zone.substring(zone.indexOf("+") + 1));
        } else if (zone.indexOf("-") > 0) {
            interval = 0 - parseInt(zone.substring(zone.indexOf("-") + 1));
        }
        //计算时差
        interval = 8 - interval;
        if (hour - interval < 0) {
            hour = 24 - Math.abs(hour - interval);
        } else {
            hour = hour - interval;
        }
        if (hour < 10) {
            hour = "0" + hour;
        }
        if (min < 10) {
            min = "0" + min;
        }
        print(hour + ":" + min);
        //console.log(hour+":"+min);
    };
    (function () {
        for (var i = 0; i < t; i++) {
            func(array[i]);
        }
    })();*/

    //因数
    /*var line = read_line();
    var t = parseInt(line);
    var factor = function (number) {
        var fs = [];
        (function () {
            for (var i = 0; i <= number; i++) {
                if (number % i === 0) {
                    fs.push(i);
                }
            }
        })();
        return fs.sort();
    };
    var func = function (number) {
        var fs = factor(number);
        if (fs.length < 3) {
            print(-1);
            return;
        }
        if (number % 3 === 0) {
            var temp = number / 3;
            print(Math.pow(temp, 3));
            return;
        }
        if (number % 4 === 0) {
            var temp = number / 2;
            var temp1 = temp / 2;
            print(temp * temp1 * temp1);
            return;
        }
        print(-1);
    };
    (function () {
        for (var i = 0; i < t; i++) {
            var temp = parseInt(read_line());
            func(temp);
        }
    })();*/

    //浇花
    /*var line = read_line();
     var tempArray = line.split(" ");
     var n = parseInt(tempArray[0]);
     var x1 = parseInt(tempArray[1]);
     var y1 = parseInt(tempArray[2]);
     var x2 = parseInt(tempArray[3]);
     var y2 = parseInt(tempArray[4]);
     //花
     var flowers = [];
     (function () {
     for (var i = 0; i < n; i++) {
     line = read_line();
     tempArray = line.split(" ");
     var obj = {};
     obj.x = parseInt(tempArray[0]);
     obj.y = parseInt(tempArray[1]);
     flowers.push(obj);
     }
     })();
     var distance_2 = function (x1, y1, x2, y2) {
     return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
     };
     var minR1R2 = function (flowers) {
     var r1 = 0, r2 = 0;
     (function () {
     for (var i = 0; i < flowers.length; i++) {
     if (distance_2(x1, y1, flowers[i].x, flowers[i].y)
     < distance_2(x2, y2, flowers[i].x, flowers[i].y)
     && distance_2(x1, y1, flowers[i].x, flowers[i].y) > r1) {
     r1 = distance_2(x1, y1, flowers[i].x, flowers[i].y);
     } else if(distance_2(x1, y1, flowers[i].x, flowers[i].y)
     > distance_2(x2, y2, flowers[i].x, flowers[i].y)
     && distance_2(x2, y2, flowers[i].x, flowers[i].y) > r2){
     r2 = distance_2(x2, y2, flowers[i].x, flowers[i].y);
     }
     }
     })();
     return r1 + r2;
     };
     print(minR1R2(flowers));*/
    //console.log(minR1R2(flowers));
    //console.log(Math.pow(-2,2));//不能用^
</script>
</body>
</html>